More Classes of Complete Permutation Polynomials over $\F_q$
نویسندگان
چکیده
In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over Fqr . In addition, we present a class of complete permutation multinomials, which is a generalization of recent work. Index Terms Finite field, Complete permutation polynomials, Walsh transform, Niho exponents.
منابع مشابه
Permutation polynomials on F_q induced from bijective Redei functions on subgroups of the multiplicative group of F_q
We construct classes of permutation polynomials over FQ2 by exhibiting classes of low-degree rational functions over FQ2 which induce bijections on the set of (Q + 1)-th roots of unity. As a consequence, we prove two conjectures about permutation trinomials from a recent paper by Tu, Zeng, Hu and Li.
متن کاملA Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from R\'{e}dei Functions
In this paper, we construct two classes of permutation polynomials over Fq2 with odd characteristic from rational Rédei functions. A complete characterization of their compositional inverses is also given. These permutation polynomials can be generated recursively. As a consequence, we can generate recursively permutation polynomials with arbitrary number of terms. More importantly, the conditi...
متن کاملSome new results on permutation polynomials over finite fields
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci. China Math., to appear. Doi: 10.1007/s11425-...
متن کاملPermutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares
We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new families of permutation polynomials. Some of these have the additional property that both f(x) and f(x) + x induce permutations of the field, which has combin...
متن کاملFive Constructions of Permutation Polynomials over $\gf(q^2)$
Four recursive constructions of permutation polynomials over GF(q2) with those over GF(q) are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over GF(q2 l ) for any positive integer l with any given permutation polynomial over GF(q). A generic construction of permutation polynomials over GF(22m) with o-polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1312.4716 شماره
صفحات -
تاریخ انتشار 2013